[Problem Link] Solution here is to add some `ordering` on the resources (i.e. forks) requested by the processes (i.e. the philosophers). Identify the resource id’s (or fork id’s) that a philosopher is surround with We make sure the process requests the `lower` id fork before the `higher` id fork to avoid deadlocks Identify which fork … Continue reading [Programming Problem] The Dining Philosophers